CO92 : combinatorial optMCDIARMID, COLIN.Discrete applied mathematics. 1995, Vol 57, Num 2-3, issn 0166-218X, 179 p.Conference Proceedings

Stochastic scheduling and forwards inductionGLAZEBROOK, K. D.Discrete applied mathematics. 1995, Vol 57, Num 2-3, pp 145-165, issn 0166-218XConference Paper

Rooted routing in the planeREED, B.Discrete applied mathematics. 1995, Vol 57, Num 2-3, pp 213-227, issn 0166-218XConference Paper

The complexity of harmonious colouring for treesEDWARDS, K; MCDIARMID, C.Discrete applied mathematics. 1995, Vol 57, Num 2-3, pp 133-144, issn 0166-218XConference Paper

The complexities of the coefficients of the Tutte polynomialANNAN, J. D.Discrete applied mathematics. 1995, Vol 57, Num 2-3, pp 93-103, issn 0166-218XConference Paper

Expected complexity of graph partitioning problemsKUCERA, L.Discrete applied mathematics. 1995, Vol 57, Num 2-3, pp 193-212, issn 0166-218XConference Paper

Regularity of matrices in min-algebra and its time- complexityBUTKOVIC, P.Discrete applied mathematics. 1995, Vol 57, Num 2-3, pp 121-132, issn 0166-218XConference Paper

Weighted fractional and integral k-matching in hypergraphsSRIVASTAV, A; STANGIER, P.Discrete applied mathematics. 1995, Vol 57, Num 2-3, pp 255-269, issn 0166-218XConference Paper